An Effective Routability-driven Placer for Mixed-size Circuit Designs
نویسندگان
چکیده
We propose a routability-driven analytical placer that aims at distributing pins evenly. This is accomplished by including a group of pin density constraints in its mathematical formulation. Moreover, for mixed-size circuits, we adopt a scaled smoothing method to cope with fixed macro blocks. As a result, we have fewer cells overlapping with fixed blocks after global placement, implying that the optimization of the global placement solution is more accurate and that the global placement solution resembles a legal solution more. Routing solutions obtained by a commercial router show that for most benchmark circuits, better routing results can be achieved on the placement results generated by our pin density oriented placer.
منابع مشابه
A Standard-Cell Placement Tool for Designs with High Row Utilization
In this paper we study the correlation between wirelength and routability for standard-cell placement problem, under the fixed-die place-androute environment. We present a placement tool with better routability for designs with high row utilization. Compared to a well-known industrial placement tool, our placer produces placements with equal or better routability, 13.2% better half-perimeter wi...
متن کاملA Standard-Cell Placement Tool for Designs with High Row Utilization
In this paper we study the correlation between wirelength and routability for standard-cell placement problem, under the modern place-androute environment. We present a placement tool named Dragon (version 2.1), and show its ability to produce good quality placement for designs with high row utilization. Compared to an industrial placer and an academic state-of-the-art placer, Dragon can produc...
متن کاملFast and Incremental Routability Check of A Topological Routing Using a Cut-based Encoding
abstract Many performance-driven routing algorithms do not consider routability. Routing trees are built assuming that there are no other wires. The main reason for this is that it is NP-hard to guarantee routability. Even checking for routabil-ity is a time-consuming process. This limits the usefulness of many performance-driven routing algorithms because unroutable designs are useless. Previo...
متن کاملTiming Driven Genetic Algorithm for Standard-cell Placement
In this paper we present a timing-driven placer for standard-cell IC design. The placement algorithm follows the genetic paradigm. A t early generations, the search is biased toward solutions with superior tarning characteristics. As the algorithm starts converging toward generations with acceptable de lay properties, the objective is dynamically adjusted toward optimizing area and routability....
متن کاملThermal Driven Placement for Island-style MTCMOS FPGAs
Rapid increase in transistor density and operating frequency has led to the increase in power densities, exhibiting itself as a high temperature profile. The high temperature spots over an FPGA impact the power, performance, and reliability of the chip, hence should be addressed during the design process. The logic block placement is targeted as the natural starting point to address the non-uni...
متن کامل